Boolean computer
英 [ˈbuːliən kəmˈpjuːtə(r)]
美 [ˈbuːliən kəmˈpjuːtər]
网络 布尔计算; 布尔计算机
双语例句
- The Boolean Satisfiability is one of the most fundamental problems in computer science and a variety of algorithms-including the well-known search-based SAT algorithms-have been proposed.
布尔可满足性是计算机科学中最基础的问题之一，已经出现了包括著名的基于查找的SAT算法在内的各种算法。 - The Boolean operation is a primary algorithm in computer graphics.
二维布尔运算是计算机图形学中的基本算法。 - The cutting process is performed through subtraction boolean operation of the simplified so1id model of workpiece and cutter on the computer.
利用简化的齿轮毛坯实体模型和盘铣刀实体模型做布尔减运算，在计算机上实现了模拟工件材料的去除过程； - Boolean logic space and series of computer
布尔逻辑空间与系列机 - Polygon Boolean operation is a key algorithm way in computer graphics.
多边形的布尔运算是计算机图形学的一个关键算法。 - This paper defines the Boolean matrix, puts forward the standard model of tree, uses the standard model to generate the defining method and the algorithm of a tree, and then realizes the algorithm with computer.
定义了图的布尔矩阵，给出了树的标准型，并且应用标准型给出了树的判定方法和算法，用计算机实现了该算法。 - With the help of this theorem the algorithm of Boolean difference can be made more efficient and some of the computer memory space will be saved.
本文给出的多通路敏化定理是一个计算布尔差分的有效公式，能使布尔差分法变得效率既高又节省内存。 - Boolean functions have wide applications in digital system and computer science.
布尔函数是数字系统与计算机科学等领域的基础，有广泛的应用。 - Boolean expression is widely used in various research fields, such as artificial intelligence, database and reliability engineering. How to realize boolean expression deduction in computer is a key issue.
布尔表达式在可靠性工程、人工智能以及数据库等领域有着广泛的应用，如何在计算机上方便有效地实现布尔表达式的演绎是一个重要的问题。 - SAT problem in classical logic means the satisfiability problem of boolean formulas. it is an essential problem of computer science.
经典逻辑中的SAT问题是指布尔表达式的可满足性问题，它是计算机科学中的核心问题。 - Retrieval model in this paper contains two parts. First, in the first retrieval, use Boolean model which returns all documents with original query. Second, in the second search, computer the correlation between local documents and the expanded query and rank the documents.
本文的检索模型包括两个部分，初次检索使用布尔模型，能检索出含有目标字符串的所有文档；二次检索使用概率模型，需要计算查询和文档的相关度，用相关度值对文档排序。 - On principle, Cellular Automata is the exclusive Boolean system method which is designed according to the characteristic of complex system and can simulate on computer.
从原理上讲，元胞自动机方法是目前唯一根据复杂系统特点设计出来的可在计算机上模拟的布尔化系统方法。